Stationary Markov chains with linear regressions
نویسنده
چکیده
In Bryc(1998) we determined one dimensional distributions of a stationary field with linear regressions (1) and quadratic conditional variances (2) under a linear constraint (7) on the coefficients of the quadratic expression (3). In this paper we show that for stationary Markov chains with linear regressions and quadratic conditional variances the coefficients of the quadratic expression are indeed tied by a linear constraint which can take only one of the two alternative forms (7), or (8).
منابع مشابه
EditionLocal convergence of the ( exact and inexact ) iterative aggregation method for linear systemsand Markov
The iterative aggregation method for the solution of linear systems is extended in several directions: to operators on Banach spaces; to the method with inexact correction, i.e., to methods where the (inner) linear system is in turn solved iteratively; and to the problem of nding stationary distributions of Markov operators. Local convergence is shown in all cases. Convergence results apply to ...
متن کاملSigman 1 Limiting distribution for a Markov chain
In these Lecture Notes, we shall study the limiting behavior of Markov chains as time n→∞. In particular, under suitable easy-to-check conditions, we will see that a Markov chain possesses a limiting probability distribution, π = (πj)j∈S , and that the chain, if started off initially with such a distribution will be a stationary stochastic process. We will also see that we can find π by merely ...
متن کاملStructured Chains with Repeated Rows: a Simple Algorithmic Solution
In this paper, we study Markov chains with innnite state block-structured transition matrix with repeated rows and rational structure. We provide an algorithmic approach to nd the stationary probability distribution based on the concepts of linear systems theory. These chains include well-known structured Markov chains such as canonical and non-canonical M/G/1 and G/M/1. We provide a truncation...
متن کاملRelative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملApproximating Queues in Slowly Varying Station- Ary Environments
We provide linear approximations to the marginal distributions for a class of infinite-state continuous-time stationary Markov chains in slowly varying environents. We take an approach motivated by light-traffic approximations to stationary point processes, which permits us to consider general stationary environments. Under mild assumptions we show that Jackson networks with routing not affecte...
متن کامل